Strategic Argumentation Under Grounded Semantics is NP-Complete
نویسندگان
چکیده
We study the complexity of the Strategic Argumentation Problem for 2-player dialogue games where a player should decide what move to play at each turn in order to prove (disprove) a given claim. We shall prove that this is an NP-complete problem. The result covers one the most popular argumentation semantics proposed by Dung [4]: the grounded semantics.
منابع مشابه
Computational Properties of Resolution-based Grounded Semantics
In the context of Dung’s theory of abstract argumentation frameworks, the recently introduced resolution-based grounded semantics features the unique property of fully complying with a set of general requirements, only partially satisfied by previous literature proposals. This paper contributes to the investigation of resolution-based grounded semantics by analyzing its computational properties...
متن کاملCEGARTIX v2017-3-13: A SAT-Based Counter-Example Guided Argumentation Reasoning Tool
We present CEGARTIX, version 2017-3-13, for the International Competition on Computational Models of Argumentation (ICCMA) 2017. Main changes are the addition of support for more reasoning tasks, relying on variations of existing Boolean encodings. The tool CEGARTIX is now capable of deciding credulous and skeptical acceptance, and enumeration of all (or up to a pre-specified bound) extensions ...
متن کاملArgumentation Mechanism Design for Preferred Semantics
Recently Argumentation Mechanism Design (ArgMD) was introduced as a paradigm for studying argumentation using game-theoretic techniques. To date, this framework has been used to study under what conditions a direct mechanism based on Dung’s grounded semantics is strategy-proof (i.e. truth-enforcing) when knowledge of arguments is private to self-interested agents. In this paper, we study Dung’s...
متن کاملArgTools: a backtracking-based solver for abstract argumentation
We present ArgTools, a system for reasoning with abstract argumentation frameworks. The system solves a number of argumentation problems under preferred, stable, complete and grounded semantics. ArgTools is a C++ implementation of a backtracking algorithm.
متن کاملOn Input/Output Argumentation Frameworks
This paper introduces Input/Output Argumentation Frameworks, a novel approach to characterize the behavior of an argumentation framework as a sort of black box exposing a well-defined external interface. As a starting point, we define the novel notion of semantics decomposability and analyze complete, stable, grounded and preferred semantics in this respect. Then we show as a main result that, ...
متن کامل